On the Erdös-Gyárfás conjecture in claw-free graphs

نویسندگان

Khodakhast Bibak

Hossein Esfandiari

Pouria Salehi Nowbandegani

Mohammad Hassan Shirdareh Haghighi

چکیده

The Erdős-Gyárfás conjecture states that every graph with minimum degree at least three has a cycle whose length is a power of 2. Since this conjecture has proven to be far from reach, Hobbs asked if the Erdős-Gyárfás conjecture holds in claw-free graphs. In this paper, we obtain some results on this question, in particular for cubic claw-free graphs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Erdös-Lovász Tihany Conjecture for Claw-Free Graphs

In 1968, Erdös and Lovász conjectured that for every graph G and all integers s, t ≥ 2 such that s + t − 1 = χ(G) > ω(G), there exists a partition (S, T ) of the vertex set of G such that χ(G|S) ≥ s and χ(G|T ) ≥ t. For general graphs, the only settled cases of the conjecture are when s and t are small. Recently, the conjecture was proved for a few special classes of graphs: graphs with stabili...

متن کامل

Erdös-Gyárfás Conjecture for Cubic Planar Graphs

In 1995, Paul Erdős and András Gyárfás conjectured that for every graph of minimum degree at least 3, there exists a non-negative integer m such that G contains a simple cycle of length 2m. In this paper, we prove that the conjecture holds for 3-connected cubic planar graphs. The proof is long, computer-based in parts, and employs the Discharging Method in a novel way.

متن کامل

List-Coloring Claw-Free Graphs with Small Clique Number

Chudnovsky and Seymour proved that every connected claw-free graph that contains a stable set of size 3 has chromatic number at most twice its clique number. We improve this for small clique size, showing that every claw-free graph with clique number at most 3 is 4-choosable and every claw-free graph with clique number at most 4 is 7-choosable. These bounds are tight.

متن کامل

Claw-free graphs, skeletal graphs, and a stronger conjecture on $\omega$, $\Delta$, and $\chi$

The second author’s ω, ∆, χ conjecture proposes that every graph satisties χ ≤ d 1 2 (∆ + 1 + ω)e. In this paper we prove that the conjecture holds for all claw-free graphs. Our approach uses the structure theorem of Chudnovsky and Seymour. Along the way we discuss a stronger local conjecture, and prove that it holds for claw-free graphs with a three-colourable complement. To prove our results ...

متن کامل